23,248 research outputs found

    Interference-Free Broadband Single- and Multi-Carrier DS-CDMA

    No full text
    The choice of the direct sequence spreading code in DS-CDMA predetermines the properties of the system. This contribution demonstrates that the family of codes exhibiting an interference-free window (IFW) outperforms classic spreading codes, provided that the interfering multi-user and multipath components arrive within this IFW, which may be ensured with the aid of quasi-synchronous adaptive timing advance control. It is demonstrated that the IFW duration may be extended with the advent of multicarrier DS-CDMA proportionately to the number of subcarriers. Hence, the resultant MC DS-CDMA system is capable of exhibiting nearsingle-user performance without employing a multi-user detector. A limitation of the system is that the number of spreading codes exhibiting a certain IFW is limited, although this problem may be mitigated with the aid of novel code design principles

    Loosely Synchronised Spreading Code Aided Network Performance of Quasi-Synchronous UTRA-like TDD and FDD CDMA Systems

    No full text
    It is demonstrated that loosely synchronised (LS) spreading codes exhibit a so-called interference-free window, where both the autocorrelation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both inter-symbolinterference and multiple-access-interference in time dispersive channels. Hence, LS codes have the potential of increasing the capacity of CDMA networks. The work reported has studied the achievable network performance and compared it to that of a UTRA-like time division duplex (TDD) and frequency division duplex (FDD) CDMA system using orthogonal variable rate spreading factor codes

    Analytical BER Performance of DS-CDMA Ad Hoc Networks using Large Area Synchronized Spreading Codes

    No full text
    The family of operational CDMA systems is interference-limited owing to the Inter Symbol Interference (ISI) and the Multiple Access Interference (MAI) encountered. They are interference-limited, because the orthogonality of the spreading codes is typically destroyed by the frequency-selective fading channel and hence complex multiuser detectors have to be used for mitigating these impairments. By contrast, the family of Large Area Synchronous (LAS) codes exhibits an Interference Free Window (IFW), which renders them attractive for employment in cost-efficient quasi-synchronous ad hoc networks dispensing with power control. In this contribution we investigate the performance of LAS DS-CDMA assisted ad hoc networks in the context of a simple infinite mesh of rectilinear node topology and benchmark it against classic DS-CDMA using both random spreading sequences as well as Walsh-Hadamard and Orthogonal Gold codes. It is demonstrated that LAS DS-CDMA exhibits a significantly better performance than the family of classic DS-CDMA systems operating in a quasi-synchronous scenario associated with a high node density, a low number of resolvable paths and a sufficiently high number of RAKE receiver branches

    Loosely synchronized spreading code aided network performance of quasi-synchronous UTRA-like TDD/CDMA systems

    No full text
    In this paper we investigate the achievable capacity of a UTRA-like Time Division Duplex (TDD) Code Division Multiple Access (CDMA) system employing Loosely Synchronized (LS) spreading codes. The family of operational CDMA systems is interference limited, suffering from Inter-Symbol-Interference (ISI), since the orthogonality of the spreading sequences is destroyed by the frequency selective channel. They also suffer from Multiple-Access-Interference (MAI) owing to the non-zero cross-correlations of the spreading codes. By contrast, the family of LS codes exhibits a so-called Interference Free Window (IFW), where both the auto-correlation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both ISI and MAI in time dispersive channels. Hence, LS codes have the potential of increasing the capacity of CDMA networks. This contribution studies the achievable network performance in comparison to that of a UTRA-like TDD/CDMA system using Orthogonal Vari- MSO able Rate Spreading Factor (OVSF) codes

    Response analysis of an automobile shipping container

    Get PDF
    The design and development of automobile shipping containers to reduce enroute damage are discussed. Vibration tests were conducted to determine the system structural integrity. A dynamic analysis was made using NASTRAN and the results of the test and the analysis are compared

    Mesoscopic conductance fluctuations in a coupled quantum dot system

    Full text link
    We study the transport properties of an Aharonov-Bohm ring containing two quantum dots. One of the dots has well-separated resonant levels, while the other is chaotic and is treated by random matrix theory. We find that the conductance through the ring is significantly affected by mesoscopic fluctuations. The Breit-Wigner resonant peak is changed to an antiresonance by increasing the ratio of the level broadening to the mean level spacing of the random dot. The asymmetric Fano form turns into a symmetric one and the resonant peak can be controlled by magnetic flux. The conductance distribution function clearly shows the influence of strong fluctuations.Comment: 4 pages, 4 figures; revised for publicatio

    Discriminative Cooperative Networks for Detecting Phase Transitions

    Get PDF
    The classification of states of matter and their corresponding phase transitions is a special kind of machine-learning task, where physical data allow for the analysis of new algorithms, which have not been considered in the general computer-science setting so far. Here we introduce an unsupervised machine-learning scheme for detecting phase transitions with a pair of discriminative cooperative networks (DCN). In this scheme, a guesser network and a learner network cooperate to detect phase transitions from fully unlabeled data. The new scheme is efficient enough for dealing with phase diagrams in two-dimensional parameter spaces, where we can utilize an active contour model -- the snake -- from computer vision to host the two networks. The snake, with a DCN "brain", moves and learns actively in the parameter space, and locates phase boundaries automatically
    • …
    corecore